Internames: a name-to-name principle for the future Internet

We propose Internames, an architectural framework in which names are used to identify all entities involved in communication: contents, users, devices, logical as well as physical points involved in the communication, and services. By not having a static binding between the name of a communication entity and its current location, we allow entities to be mobile, enable them to be reached by any of a number of basic communication primitives, enable communication to span networks with different technologies and allow for disconnected operation. Furthermore, with the ability to communicate between names, the communication path can be dynamically bound to any of a number of end-points, and the end-points themselves could change as needed. A key benefit of our architecture is its ability to accommodate gradual migration from the current IP infrastructure to a future that may be a ubiquitous Information Centric Network. Basic building blocks of Internames are: i) a name-based Application Programming Interface; ii) a separation of identifiers (names) and locators; iii) a powerful Name Resolution Service (NRS) that dynamically maps names to locators, as a function of time/location/context/service; iv) a built-in capacity of evolution, allowing a transparent migration from current networks and the ability to include as particular cases current specific architectures. To achieve this vision, shared by many other researchers, we exploit and expand on Information Centric Networking principles, extending ICN functionality beyond content retrieval, easing send-to-name and push services, and allowing to use names also to route data in the return path. A key role in this architecture is played by the NRS, which allows for the co-existence of multiple network "realms", including current IP and non-IP networks, glued together by a name-to-name overarching communication primitive.Comment: 6 page

NF-TCP: A Network Friendly TCP Variant for Background Delay-Insensitive Applications

Delay-insensitive applications, such as P2P file sharing, generate substantial amounts of traffic and compete with other applications on an equal footing when using TCP. Further, to optimize throughput, such applications open multiple connections. This results in an unfair and potentially poor service for other applications having stringent performance objectives. In this paper, we propose NF-TCP, a TCP variant for P2P and similar background delay-insensitive applications. NF-TCP aims to be submissive to delay-sensitive applications under congestion. It is designed to be network friendly based on a fluid flow model for intermediate queues and uses explicit congestion notification (ECN) for early detection of congestion. Moreover, it exploits the measure of the available bandwidth to be able to aggressively utilize spare capacity. We implemented NF-TCP on Linux and ns-2. Our evaluations of the NF-TCP Linux implementation on ns-2 show that NF-TCP outperforms other network friendly approaches (e.g., LEDBAT, TCP-LP and RAPID). NF-TCP achieves high utilization, fair bandwidth allocation among NF-TCP flows and maintains a small average queue. Our evaluations further demonstrate that with NF-TCP, the available bandwidth can be efficiently utilized for supporting both delay-sensitive and insensitive traffic in a wid

Reliable Publish/Subscribe in Content-Centric Networks

Managing congestion is a challenge in content-centric networks due to the lack of an end-to-end session context over which a ‘flow ’ may be controlled. Flow and congestion control as well as reliable delivery are often considered even more of a challenge in content-centric publish/subscribe systems, where the nature of information dissemination is similar to multicast. These have been long-standing challenges also for IP multicast. With an unknown number of publishers, a content-centric pub/sub environment exacerbates these problems, demanding new solutions. In this paper, we propose a lightweight enhancement to content-centric publish/subscribe systems for flow and congestion control as well as for reliability. R-COPSS allows the publishers to efficiently use the content-centric network by having subscribers generate timely feedback while enabling subscribers to make use of NDN to perform local repair for reliable delivery. Rather than having all subscribers generate feedback (ACK) per packet, we seek to elect particular subscribers in a hierarchy to provide the feedback and the rest of them resort to a periodical summary. Our approach not only reduces the load on the publisher, but also removes the requirement on the publisher to limit its sending rate to the slowest subscriber. Our preliminary results show that R-COPSS performs better in terms of overall throughput and is fair to competing flows